The cutting stock problem and excessive accumulation of usable leftovers
نویسندگان
چکیده
Many methods exist for solving the one-dimensional cutting stock optimization problem with usable leftovers (CSPUL), but none of them consider the excessive generation of usable leftovers (UL) in stock after several consecutiveorders. To highlight this problem, the COLA method for solving the CSPUL [1] was selected. We performed experiments that showed how UL in stock continuously grow when the threshold t for returning the UL back to stock is set to minimum order size. Future studies should take into account various t to prevent the accumulation of UL in stock. To the best of our knowledge, this problem has not been addressed in the literature so far. Key-Words: Cutting stock, optimization, simulation, usable leftovers, trim-loss minimization, inventory costs.
منابع مشابه
Two-stage two-dimensional guillotine cutting problems with usable leftovers∗
In this study we are concerned with the non-exact two-stage two-dimensional guillotine cutting problem considering usable leftovers, in which stock plates remainders of the cutting patterns (non-used material or trim loss) can be used in the future, if they are large enough to fulfill future demands of items (ordered smaller plates). This cutting problem can be characterized as a residual bin-p...
متن کاملTwo-stage two-dimensional guillotine cutting stock problems with usable leftover
In this study we are concerned with the non-exact two-stage two-dimensional guillotine cutting problem considering usable leftovers, in which stock plates remainders of the cutting patterns (non-used material or trim loss) can be used in the future, if they are large enough to fulfill future demands of items (ordered smaller plates). This cutting problem can be characterized as a residual bin-p...
متن کاملMIP models for two-dimensional non-guillotine cutting problems with usable leftovers
In this study we deal with the two-dimensional non-guillotine cutting problem of how to cut a set of larger rectangular objects to a set of smaller rectangular items in exactly a demanded number of pieces. We are concerned with the special case of the problem in which the non-used material of the cutting patterns (objects leftovers) may be used in the future, for example if it is large enough t...
متن کاملA simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کامل